On the Equivalence of Optimality Design Criteria for the Placebo-Treatment Problem
نویسندگان
چکیده
We consider a class of optimality criteria and show that each criterion has its unique and equivalent dual within the class. This property can be used to find a variety of optimal designs, including a class of compound optimal designs and their relationships. As an example, we show that one type of D-optimal design provides analytical formula for a class of compound optimal designs, while its dual, the more traditional criterion, cannot.
منابع مشابه
Low-Area/Low-Power CMOS Op-Amps Design Based on Total Optimality Index Using Reinforcement Learning Approach
This paper presents the application of reinforcement learning in automatic analog IC design. In this work, the Multi-Objective approach by Learning Automata is evaluated for accommodating required functionalities and performance specifications considering optimal minimizing of MOSFETs area and power consumption for two famous CMOS op-amps. The results show the ability of the proposed method to ...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملIsogeometric Topology Optimization by Using Optimality Criteria and Implicit Function
A new method for structural topology optimization is introduced which employs the Isogeometric Analysis (IA) method. In this approach, an implicit function is constructed over the whole domain by Non-Uniform Rational B-Spline (NURBS) basis functions which are also used for creating the geometry and the surface of solution of the elasticity problem. Inspiration of the level set method zero level...
متن کامل